Drawing by Ear: Interpreting Sonified Line Graphs

نویسندگان

  • Lorna M. Brown
  • Stephen A. Brewster
چکیده

The research presented here describes a pilot study into the interpretation of sonified line graphs containing two data series. The experiment aimed to discover the level of accuracy with which sighted people were able to draw sketches of the graphs after listening to them. In addition, it aimed to identify any differences in performance when the graphs were presented using different combinations of instruments—either with piano representing both data series (same-instruments condition), or with piano representing one data series and trumpet representing the other (different-instruments condition). The drawings were evaluated by calculating the percentage of key features present. The results showed that accuracy was high (over 80% on average) in both conditions, but found no significant differences between the two. There were indications of some differences between the two conditions, but a larger study is necessary to discover whether these are significant. The results indicate that graph sonification systems should allow users to choose between these two presentation modes, depending on their preference and current task. The study showed that sonified graphs containing two data series can be interpreted, and drawn, by sighted people, and that evaluation with blind users (our target users) would be worthwhile.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Environment for Studying the Impact of Spatialising Sonified Graphs on Data Comprehension

We describe AudioCave, an environment for exploring the impact of spatialising sonified graphs on a set of numerical data comprehension tasks. Its design builds on findings regarding the effectiveness of sonified graphs for numerical data overview and discovery by visually impaired and blind students. We demonstrate its use as a test bed for comparing the approach of accessing a single sonified...

متن کامل

Whither Andwherefore the Auditory Graph? Abstractions &æsthetics in Auditory and Sonified Graphs

A good deal of attention has been paid by the auditory display community to the sonification of graphical data and the term auditory graph has been used to describe this class of auditory mappings. We contend that definitions have become blurred leading to first-order sonifications of functions and data being treated as synonymous with the secondand higher-order mappings obtained when graphs of...

متن کامل

Algorithms for Drawing Plane Graphs

Graph drawing addresses the problem of constructing geometric representation of information and finds applications in almost every branch of science and technology. Efficient algorithms are essential for automatic drawings of graphs, and hence a lot of research has been carried out in the last decade by many researchers over the world to develop efficient algorithms for drawing graphs. In this ...

متن کامل

Convex drawings of hierarchical planar graphs and clustered planar graphs

Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, software visualisation and visualisation of social networks and biological networks. Straight-line drawing algorithms for hierarchical graphs and clustered graphs have been presented in [P. Eades, Q. Feng, X. Lin and H. Nag...

متن کامل

Drawing Planar Graphs with Many Collinear Vertices

Given a planar graph G, what is the maximum number of collinear vertices in a planar straight-line drawing of G? This problem resides at the core of several graph drawing problems, including universal point subsets, untangling, and column planarity. The following results are known: Every n-vertex planar graph has a planar straight-line drawing with Ω( √ n) collinear vertices; for every n, there...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003